Sparse bounds for the bilinear spherical maximal function
نویسندگان
چکیده
We derive sparse bounds for the bilinear spherical maximal function in any dimension d ⩾ 1 $d\geqslant 1$ . When 2 2$ , this immediately recovers sharp L p × q → r $L^p\times L^q\rightarrow L^r$ bound of operator and implies quantitative weighted norm inequalities with respect to Muckenhoupt weights, which seems be first their kind operator. The key innovation is a group newly developed continuity $L^p$ improving estimates single-scale averaging
منابع مشابه
The Bilinear Maximal Functions
The bilinear maximal operator defined below maps L × L into L provided 1 < p, q <∞, 1/p+ 1/q = 1/r and 2/3 < r ≤ 1. Mfg(x) = sup t>0 1 2t ∫ t −t |f(x+ y)g(x− y)| dy In particular Mfg is integrable if f and, g are square integrable, answering a conjecture posed by Alberto Calderón. 1 Principal Results In 1964 Alberto Calderón defined a family of maximal operators by Mfg(x) = sup t>0 1 2t ∫ t −t ...
متن کاملUniform Bounds for the Bilinear Hilbert Transforms
It is shown that the bilinear Hilbert transforms Hα,β(f, g)(x) = p.v. ∫ R f(x− αt)g(x− βt) dt t map Lp1(R) × Lp2(R) → Lp(R) uniformly in the real parameters α, β when 2 < p1, p2 < ∞ and 1 < p = p1p2 p1+p2 < 2. Combining this result with the main result in [9], we deduce that the operators H1,α map L2(R)×L∞(R) → L2(R) uniformly in the real parameter α ∈ [0, 1]. This completes a program initiated...
متن کاملBounds for spherical codes
A set C of unit vectors in R is called an L-spherical code if x ·y ∈ L for any distinct x, y in C. Spherical codes have been extensively studied since their introduction in the 1970’s by Delsarte, Goethals and Seidel. In this note we prove a conjecture of Bukh on the maximum size of spherical codes. In particular, we show that for any set of k fixed angles, one can choose at most O(d) lines in ...
متن کاملSparse Bilinear Logistic Regression
In this paper, we introduce the concept of sparse bilinear logistic regression for decision problems involving explanatory variables that are two-dimensional matrices. Such problems are common in computer vision, brain-computer interfaces, style/content factorization, and parallel factor analysis. The underlying optimization problem is biconvex; we study its solution and develop an efficient al...
متن کاملThe Bilinear Maximal Function Maps into L P for 2=3 < P 1
The bilinear maximal operator de ned below maps L L into L provided 1 < p; q <1, 1=p+ 1=q = 1=r and 2=3 < r 1. Mfg(x) = sup t>0 1 2t Z t t jf(x+ y)g(x y)j dy In particular Mfg is integrable(!) if f and, g are square integrable, answering a conjecture posed by Alberto Calder on. 1 Principal Results In 1964 Alberto Calder on de ned the maximal operator Mfg(x) = sup t>0 1 2t Z t t jf(x y)g(x y)j d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the London Mathematical Society
سال: 2023
ISSN: ['1469-7750', '0024-6107']
DOI: https://doi.org/10.1112/jlms.12715